Ofdm Channel Estimation and Tracking for Multiple Transmit Antennas

ABSTRACT

Multiple Transmit Multiple Receive Orthogonal Frequency Division Multiplexing (‘OFDM’) comprising generating bit streams and corresponding sets of N frequency domain carrier amplitudes ({tilde over (s)}(kN+j), 0≦j≦N−1) modulated as OFDM symbols subsequently to be transmitted from a transmitter, where k is the OFDM symbol number and j indicates the corresponding OFDM carrier number. Affix information is inserted at the transmitter into guard intervals between consecutive time domain OFDM symbols and are used at the receiver to estimate the Channel Impulse Response (H lm ) of the transmission channels, the estimated Channel Impulse Response (Ĥ lm ) being used to demodulate the bit streams in the signals received at the receiver. The affix information is known to the receiver, as well as to the transmitter, and is mathematically equivalent to a vector (c D ) that is common to the time domain OFDM symbols multiplied by at least first weighting factors (α k ) that are different for one time domain OFDM symbol (k) than for another and second weighting factors (w i (k)) that enable one of the transmit antenna means (i) to be distinguished from another.

FIELD OF THE INVENTION

This invention relates to communication using Orthogonal Frequency Division Multiplexing (‘OFDM’) and, more particularly, to channel estimation and tracking in OFDM communication.

BACKGROUND OF THE INVENTION

This invention relates to communication using Orthogonal Frequency Division Multiplexing (‘OFDM’) and, more particularly, to channel estimation and tracking in OFDM communication.

BACKGROUND OF THE INVENTION

OFDM communication has been chosen for most of the modern high-data rate communication systems (Digital Audio Broadcast—DAB, Terrestrial Digital Video Broadcast—DVB-T, and Broadband Radio Access Networks—BRAN such as HIPERLAN/2, IEEE802.11a/g, IEEE802.15.3a, for example, and is considered for future wide-band telephony standards, referred to as “4G”). However, in most cases the receiver needs an accurate estimate of the channel impulse response. Also, in the context of wireless local area networks (‘WLANs’), current data rates (54 Mbps on top of the physical layer) are foreseen to be insufficient for very dense urban deployment, such as for hot spot coverage. This is the motivation for IEEE to propose and specify in the scope of the IEEE802.11n (the former High Throughput Study Group) solutions for very high data rate WLANs (targeting at least 100 Mbps on top of the medium access control (‘MAC’) layer) in the 5 GHz band. Another area of investigation is that of higher frequency bands where more spectrum is available such as the 60 GHz band.

One way of achieving higher data rates is to provide the system with multiple antennas both at the transmitter and at the receiver. By doing so, it is possible to increase the quality of the communication link by exploiting the spatial diversity dimension using for instance Space Time Block Codes (‘STBC’), or to increase the spectral efficiency of the system by transmitting simultaneously different streams using Spatial Division Multiplexing. Therefore, Multiple Transmit Multiple Receive (MTMR) antenna systems are strong candidates for next generation WLANs and certain other OFDM communication systems.

In the so-called Cyclic Prefix OFDM (CP-OFDM) modulation scheme, each OFDM symbol is preceded by a guard interval that is longer than the channel impulse response (CIR) and a cyclic prefix or postfix, hereinafter referred to collectively as a cyclic affix, is inserted at the transmitter in a guard interval between consecutive OFDM symbols, the cyclic affix consisting of samples circularly replicated from the useful OFDM symbol time domain samples. The cyclic affix enables very simple calculation for the equalisation at the receiver, where the cyclic affix is discarded and each truncated block is processed, for example using Fourier Transform (usually Fast Fourier Transform (FFT)), to convert the frequency-selective channel output into parallel flat-faded independent sub-channel outputs, each corresponding to a respective sub-carrier. For equalisation purposes, numerous strategies exist. Following the zero forcing approach, for example, each sub-channel output is, unless it is zero, divided by the estimated channel coefficient of the corresponding sub-carrier.

In the Zero Padded OFDM (ZP-OFDM) modulation scheme, as described for example in the article by B. Muquet, Z. Wang, G. B. Giannakis, M. de Courville, and P. Duhamel entitled “Cyclic Prefixing or Zero Padding for Wireless Multicarrier Transmissions” IEEE Trans. on Communications, 2002, the cyclic affix is replaced by null samples. This solution relying on a larger FFT demodulator, has the merit to guarantee symbol recovery irrespective of channel null locations when the channel is known.

However channel estimation and tracking remains an issue, especially in the presence of high mobility or high frequency and data rates. Like other digital communication systems, OFDM modulation encounters problems at high Doppler spreads, which occur notably when the user is moving fast, for example in a car, or even at pedestrian speeds when investigating the area of higher frequency bands where more spectrum is available such as the 60 GHz band. Accordingly, the channel impulse response needs to be constantly tracked and updated, especially in the presence of high Doppler spreads.

It would be desirable for the OFDM modulation system to keep all the advantages of classic OFDM and additionally allow very simple and (semi-)blind channel estimation at the receiver. Semi-blind channel estimation means that substantially no additional redundancy is added to the system with respect to classic CP-OFDM, and therefore no bandwidth for data transmission would be lost; however, semi-blind channel estimation can be realized thanks to deterministic sequences known at both the transmitter and the receiver sides, as long as there is no substantial bandwidth loss for data transmission. Such a system would be advantageous in low-mobility scenarios and would make OFDM systems applicable to high-mobility scenarios as well.

Our co-pending European Patent Application EP 02 292 730.5 describes a communication method in which the CP-OFDM time domain redundancy is replaced by a pseudo-randomly weighted deterministic sequence which leads to the so called Pseudo Random Postfix OFDM (PRP-OFDM). The advantages of being able to use ZP-OFDM are preserved and low complexity channel estimation at the receiver is made possible. Note that PRP-OFDM does not impact the achieved useful data rate and spectral efficiency compared to the classical CP-OFDM modulator, apart possibly from transmission of small amounts of data for the calculation of pseudo random parameters, since the only modification is the affix content, thus the low complexity channel estimation possible at the receiver side is also semi-blind.

Our co-pending European Patent Application describes the application of PRP-OFDM to single transmit antenna systems and it is desirable to apply comparable techniques to MTMR systems, capable of using more than one transmit and/or receive antenna.

SUMMARY OF THE INVENTION

The present invention provides a method of communication using Orthogonal Frequency Division Multiplexing, a transmitter and a receiver as described in the accompanying claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic block diagram of a transmitter in a communication system in accordance with one embodiment of the invention, given by way of example,

FIG. 2 is a schematic block diagram of a receiver in the communication system whose transmitter is shown in FIG. 1,

FIG. 3 is a diagram of signals appearing in operation of the modulator of FIG. 2, and

FIG. 4 is a diagram of a moving average Doppler module for the demodulator of FIG. 1,

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 1 and FIG. 2 show an OFDM communication system in accordance with one embodiment of the invention comprising a transmitter including an OFDM modulator 1 and a receiver including an OFDM demodulator 2, the transmitter and the receiver communicating over a communication channel 3.

The OFDM communication method of this embodiment of the present invention enables estimation and tracking of the Multiple Input Multiple Output (‘MIMO’) channels in coherent multiple transmit antenna/multiple receive antenna (‘MTMR’) systems, without any specific limit to the number of transmit (TX) and receive (RX) antennas and without imposing any particular Space-Time Code (STC). Data and affix vectors are independently encoded by two STC and enable a semi-blind estimation of all the MIMO channels exploiting only the order-one statistics of the received signal.

In the following description, lower (upper) boldface symbols will be used for column vectors (matrices) sometimes with subscripts N or P emphasizing their sizes (for square matrices only); tilde (‘{tilde over ( )}’) will denote frequency domain quantities; argument i will be used to index blocks of symbols; H(T) will denote Hermitian (transpose) operations.

FIG. 1 depicts the baseband discrete-time block equivalent model of an N-carrier PRP-OFDM MTMR transceiver with N_(t) transmit and N_(r) receive antennae. The communication system is described with reference to Space-Time (ST) block codes (‘STBCs’) but it will be appreciated that the invention is also applicable to other code systems. In the transmitter, the Initial serial bit stream of constellation symbols {tilde over (s)}(jN), . . . , {tilde over (s)}(jN+N−1) is converted to a set of vectors in a serial-to-parallel converter (not shown); the jth N×1 input digital vector {tilde over (s)}(j) is then modulated by an Inverse Fast Fourier Transform (‘IFFT’) matrix F_(N) ^(H) in a transformer 4, where

${\left\lbrack F_{N} \right\rbrack_{k,l} = {\frac{1}{\sqrt{N}}W_{N}^{kl}}},{0 \leq k < N},{{0 \leq l < {N\mspace{14mu} {and}\mspace{14mu} W_{N}}} = {^{{- {j2\pi}}/N}.}}$

The resulting N−1 time domain vector s(j) is processed by a suitable ST encoder matrix

in an encoder 10, as shown in FIG. 1, creating outputs S(t)=

(s(iN_(t)), . . . , s(iN_(t)+N_(t)−1))={s(iM+k), 1≦l≦N_(t), 0≦k<M} where i is the block number l is the number of the TX antenna and n=iM+k indexes the outputs in FIG. 1. It will be appreciated that, at least in the context of STBCs, M can differ from N_(t); In particular, the STBC may lead to rectangular S(i), that is to say that M>N_(t). For the sake of simplicity, we assume in the following description that

operates on N_(t); inputs (s(iN_(t)), . . . , s(iN_(t)+N_(t)−1)). However, the invention can be straightforwardly applied to

with other numbers of inputs. In this embodiment of the invention, the s(iM+k) are linearly precoded in a precoder 11 by a zero-padded OFDM (‘ZP-OFDM’) precoding matrix T_(ZP), where

$T_{ZP} = \begin{bmatrix} I_{N} \\ 0_{D,N} \end{bmatrix}_{P \times N}$

and u(n)=T_(ZP) s(n), 1≦l≦N_(t).

The affix contents v(n) are added to the data symbols u(n)=T_(ZP) s(n), 1≦l≦N, resulting in the output vectors q(n). The output vectors q(n) are converted to a series signal by a parallel-to-series converter 6, a pseudo random postfix being inserted in the signal into guard intervals between each consecutive OFDM symbol to produce a series digital signal s(n) on the lth TX atenna. The series digital signal s(n) is then converted to an analogue signal s(t) by a digital-to-analogue converter 7 and transmitted over the channel 3.

More particularly, in a preferred embodiment of the invention, the postfix that is added in the guard interval comprises a pre-calculated suitable vector that is independent of the data and that is weighted by a first factor α_(k) and a second factor w_(i)(k). In one embodiment of the invention, the first factor α_(k) is different from one time-domain OFDM symbol to another and is known both to the transmitter 1 and to the receiver 2, so that any time domain (cyclo-)stationarity (leading to strong undesired frequency contributions at the repetition frequency) is avoided. In another embodiment of the invention, in which the symbols are coded in blocks, the first factor α_(k) is different from one time-domain OFDM symbol block to another but is the same for each symbol of the same block. The second factor w_(i)(k) enables one of the transmit antennas to be distinguished from another.

With an OFDM modulator in the transmitter functioning in this way, semi-blind channel estimation in the receiver can be done simply and at low arithmetical complexity. In particular, the receiver can constantly estimate and track the channel Impulse response without any loss of data bandwidth compared to CP-OFDM, other than the transmission of PR-calculation parameters. Moreover, the demodulator at the receiver can have advantageous characteristics, ranging from very low arithmetical cost (at medium performance) to les low arithmetical cost (with very good system performance).

As described In our copending European Patent Application referred to above for the single antenna case, several choices for the first factor α_(k) are possible. It is possible to choose α_(k) of any complex value. However, any α_(k) with |α_(k)|≠1 leads to performance degradation compared to preferred embodiments of the invention.

It is possible to limit the choice of α_(k), somewhat less generally to a complex value with |α_(k)|=1. This choice usually leads to good system performance, but the decoding process risks to be unnecessarily complex. Preferred values of the first and second factors are described in more detail below.

Preferably, the first factor α_(k) is pseudo-random. In one embodiment of the present invention the first factor α_(k) is deterministic and is calculated both by the modulator 1 and the demodulator 2 using the same algorithm and parameters that are stored in memory both in the transmitter and in the receiver. In another embodiment of the present invention, initialisation parameters for the algorithm are transmitted between the transmitter and the receiver to avoid systematically using the same sequence for the first factor α_(k). In yet another embodiment of the present invention, the first factor α_(k) is communicated from the transmitter 1 to the receiver 2, which still represents an acceptable overhead in certain circumstances.

In the embodiment of the present invention shown in FIG. 1 and FIG. 2, the affix is deterministic and is a D×1 postfix vector c treated in an encoder 12 by a specific ST encoder matrix

which outputs the D×1 vectors c(n), 1≦l≦N_(t). The way in which

ensures identification of the complete MIMO channel is described in more detail below. The postfix vectors c(n), 1≦l≦N, are then linearly precoded in a precoder 13 by a ZP-OFDM matrix T_(P), where

${T_{P} = \begin{bmatrix} 0_{N,D} \\ I_{D} \end{bmatrix}_{P \times D}},$

to produce zero-padded postfix vectors as shown at 14 in FIG. 3.

The resulting vectors v_(l)(n) are finally added to the data symbols u_(l)(n) by adders 15: q_(l)(n)=u_(l)(n)+v_(l)(n), 1≦l≦N, to produce signals 16 for transmission.

The signals received at the receive antennas are the transmitted signals multiplied by the Channel Impulse Response (‘CIR’) H_(lm) and with the addition of noise and interference n_(l)(n). Let H_(lm) be a P×P circulant matrix whose first row is given by [h_(l)(0), 0, . . . 0, h_(l)(L−1), . . . , h_(l)(1)], where h_(l)=[h_(l)(0), . . . , h_(l)(L−1), 0, . . . 0]^(T) is the P×1 channel impulse response between the lth transmit and the mth receive antennae; D is chosen such that D≧L−1. Define H_(lm) ^(ISI) as the lower triangular part of H_(lm) including the main diagonal which represents the Intra-Symbol-Interference (ISI); H_(lm) ^(ISI) shall contain the upper triangular part of H_(lm) representing the Inter-Block-Interference (IBI), such that H_(lm)=H_(lm) ^(ISI)+H_(lm) ^(IBI). Therefore, the received signal vector on the mth antenna, 1≦m≦N, is, given by:

${r_{m}(n)} = {{\sum\limits_{l = 1}^{N_{t}}\left\lbrack {{H_{l\; m}^{ISI}{q_{l}(n)}} + {H_{l\; m}^{IBI}{q_{l}\left( {n - 1} \right)}}} \right\rbrack} + {n_{m}(n)}}$

where n_(m)(n) is an zero-mean additive white independent identically distributed gaussian noise term.

As shown in FIG. 2, The demodulator 2 at the receiver comprises an analogue-to-digital converter 7 that converts the signals r_(m)(t) received at the receive antennas to digital signals, a serial-to-parallel converter 8, which converts the received digital signals to received vectors r_(m)(n), and a demodulator and equaliser 9 that uses decoding matrices corresponding to the encoding matrices

and

to estimate the Channel Impulse Response CIR and demodulate the OFDM signals.

In the following description of the operation of the receiver, an order-one channel estimation algorithm is described first, assuming the channel to be static. Then, the effect of Doppler is introduced for the mobility case and the corresponding channel estimator in the Minimum Mean Square Error (MMSE) sense described.

First the received vector r_(m)(n) is expressed in an exploitable form for channel estimation. For that purpose, let H_(lm) ^(D) be the D×D circulant matrix of first row [h_(lm)(0), 0, . . . 0, h_(lm)(L−1), . . . , h_(lm)(1)]. We define H_(lm) ^(ISLD) and H_(lm) ^(IBLD) such that H_(lm) ^(D)=H_(lm) ^(ISLD)+H_(lm) ^(IBLD). The signal r_(m)(n), received during the nth OFDM symbol on the mth antenna, 1≦m≦N_(t), is equal to:

$\begin{matrix} {{r_{m}(n)} = {{\sum\limits_{l = 1}^{N_{t}}\begin{bmatrix} {{H_{l\; m}^{{ISI},D}{{\overset{\_}{s}}_{l,0}(n)}} + {H_{l\; m}^{{IBI},D}{{\overset{\_}{c}}_{l}\left( {n - 1} \right)}}} \\ \vdots \\ {{H_{l\; m}^{{IBI},D}{{\overset{\_}{s}}_{l,1}(n)}} + {H_{l\; m}^{{ISI},D}{{\overset{\_}{c}}_{l}\left( {n - 1} \right)}}} \end{bmatrix}} + \begin{bmatrix} {n_{m,0}(n)} \\ \vdots \\ {n_{m,1}(n)} \end{bmatrix}}} & {{Equation}\mspace{14mu} 1} \end{matrix}$

where s _(l,0)(n), s _(l,1)(n), n_(m,0)(n) are respectively the first D and last D samples of s _(l)(n) and n_(m)(n).

Equation 1 indicates that a superimposition of the various postfixes convolved by the corresponding channels is interfering with the useful data. An easy independent retrieval of each of the channels based on the sole observation of the postfix contributions is obtained through isolation of each postfix convolved by its related channel. As detailed below, a way to achieve that condition is to perform a Fast Fourier Transform on the postfixes in the demodulator and equaliser 9 using a weighting ST block coding scheme

of the postfix c according to the following postfix generation process:

$\begin{matrix} {\begin{bmatrix} {{\overset{\_}{c}}_{l}({iM})} & \ldots & {{\overset{\_}{c}}_{l}\left( {{iM} + M - 1} \right)} \\ \vdots & ⋰ & \vdots \\ {{\overset{\_}{c}}_{N_{t}}({iM})} & \ldots & {{\overset{\_}{c}}_{N_{t}}\left( {{iM} + M - 1} \right)} \end{bmatrix} = {\quad{\underset{\underset{W}{}}{\begin{bmatrix} {{w_{l}(0)}{\alpha ({iM})}} & \ldots & {{w_{l}\left( {M - 1} \right)}{\alpha \left( {{iM} + M - 1} \right)}} \\ \vdots & ⋰ & \vdots \\ {{w_{N_{t}}(0)}{\alpha ({iM})}} & \ldots & {{w_{N_{t}}\left( {M - 1} \right)}{\alpha \left( {{iM} + M - 1} \right)}} \end{bmatrix}} \otimes c}}} & {{Equation}\mspace{14mu} 2} \end{matrix}$

where

is the Kronecker product and c, α(n) are respectively the deterministic postfix and the pseudo-random weighting factors introduced in our co-pending European Patent Application EP 02 292 730.5 for the single antenna case. The pseudo-random weighting factors α(n) are used to convert the deterministic postfix c into a pseudo-random one. Note that a new set of deterministic weighting factors is introduced, and gathered In the M×N, matrix W corresponding to the matrix W used for encoding the postfixes in the transmitter encoder, with [W]_(k,l−1)=w_(l)(k), 0≦k<M, 1≦l≦N_(t). W is used to remove the interference between all transmitted postfixes and thus is Invertible in this embodiment of the present invention: full column rank (rank(W)=n_(t)). In the following description, we choose W orthogonal for this embodiment of the present invention, such that W^(H)W=I_(N) _(t) .

With the assumption of a static channel, an order-one channel estimator in the demodulator and equaliser 9 functions as follows. The first and last D samples of r_(m)(n) are denoted respectively by r_(m,0)(n) and r_(m,1)(n). By setting n=iM+k and assuming the transmitted time domain signal s _(l)(n) to be zero mean for all l, we use Equations 1 and 2 to compute for each k, 0≦k<M, the following D×1 vector:

$\begin{matrix} {{d_{m}^{k}(i)} = \frac{{r_{m,1}\left( {{iM} + k} \right)} + {r_{m,0}\left( {{iM} + k + 1} \right)}}{\alpha \left( {{iM} + k} \right)}} & {{Equation}\mspace{14mu} 3} \end{matrix}$

Next d_(m) ^(k)=E[d_(m) ^(k)(i)] is defined as the expectation of d_(m) ^(k)(i). Due to the deterministic nature of the postfixes, it can be verified from Equation 1 that:

$\begin{matrix} {d_{m}^{k} = {{\sum\limits_{l = 1}^{N_{t}}{\left\lbrack {H_{l\; m}^{{ISI},D} + H_{l\; m}^{{IBI},D}} \right\rbrack {w_{l}(k)}c}} = {\sum\limits_{l = 1}^{N_{t}}{H_{l\; m}^{D}{w_{l}(k)}c}}}} & {{Equation}\mspace{14mu} 4} \end{matrix}$

Thus the MD×1 vector d_(m)=[(d_(m) ⁰)^(T), . . . , (d_(m) ^(M−1))^(T)]^(T) can be expressed for each receive antenna as:

$\begin{matrix} {d_{m} = {{\sum\limits_{l = 1}^{N_{t}}\begin{bmatrix} {H_{l\; m}^{D}{w_{l}(0)}c} \\ \vdots \\ {H_{{l\; m}\;}^{D}{w_{l}\left( {M - 1} \right)}c} \end{bmatrix}} = {\left( {W \otimes I_{D}} \right)\begin{bmatrix} {H_{l\; m}^{D}c} \\ \vdots \\ {H_{N,m}^{D}c} \end{bmatrix}}}} & {{Equation}\mspace{14mu} 5} \end{matrix}$

Since W is chosen orthogonal, multiplying each d_(m), 1≦m≦N, by (W

I_(D))^(H) in the demodulator and equaliser 9 removes completely the interference between channel contributions H_(lm) ^(D), 1≦l≦N_(t).

Once the interference between channel contributions is removed the estimation algorithms of the single-antenna case of our co-pending European Patent Application EP 02 292 730.5 can be applied in the demodulator and equaliser 9:

H_(lm) ^(D)c=C_(D)h_(lm) ^(D)=F_(D) ^(H){tilde over (C)}_(D)F_(D)h_(lm) ^(D)  Equation 6

where C_(D) is a D×D circulant matrix with the first row [c(0), c(D−1), . . . , c(1)], {tilde over (C)}_(D)=diag{F_(D)c}, and h_(lm) ^(D) represents the D first coefficients of h_(lm). Hence, the estimate ĥ_(lm) ^(D) of the time domain channel impulse response h_(lm) ^(D) in the demodulator and equaliser 9 is obtained by multiplying H_(lm) ^(D) by F_(D) ^(H){tilde over (C)}_(D) ⁻¹F_(D), 1≦l≦N_(t), 1≦m≦N_(t). Note that {tilde over (C)}_(D) ⁻¹ is a diagonal matrix that is known to both the transmitter and receiver and can thus be precalculated. Subsequently, h_(lm) ^(D) is preferably transformed to the P×1 frequency domain vector

${\overset{\hat{\sim}}{h}}_{l\; m} = {{F_{P}\left\lbrack {I_{D}^{T},0_{N,D}^{T}} \right\rbrack}^{T}{{\hat{h}}_{l\; m}^{D}.}}$

This MIMO channel estimation (i.e. estimation of all channels between any transmit and any receive antenna) is used to space-time decode and equalise the received data signals, as described in more detail in examples below, such that the transmitted data signals can be recovered.

The above channel estimator can be extended to further improve reception in mobile environments by using any Doppler model, and by minimizing any performance criterion. An example is now given, in a preferred embodiment of the present invention based on the introduction of a Doppler model; the estimator aims at minimizing the Mean Square Error (MSE).

The Doppler module shown in FIG. 4 is introduced in the demodulator and equaliser 9 to modify the order-one autoregressive model for the Channel Impulse Response (‘CIR’) between transmit antenna l and receive antenna m separately: h_(lm) ^(D)(n)=J₀(2πƒ_(D)ΔT)h_(lm) ^(D)(n−1)+ h _(lm) ^(D)(n) where J₀(·) is the 0th order Bessel function. ƒ_(D) is the Doppler frequency, ΔT is the MTMR PRP-OFDM block duration and {hacek over (h)}_(lm) ^(D)(n) is zero-mean complex Gaussian of constant variance. The same CIR correlations as the ones provided by the known Jakes model are obtained even in the presence of large Doppler frequencies. This is achieved by forcing the correlation E└(h_(lm) ^(D)(n))^(H)h_(lm) ^(D)(k)┘=J₀(2πƒ_(D)(k−n)ΔT)∀k>n. This way the approximation J₀(2πƒ_(D)(k−n)ΔT)=(J₀(2πƒ_(D)ΔT))^((k−n)), inherent to the order-one autoregressive estimation, is avoided. This modification leads to the following moving average estimation:

$\begin{matrix} {{h_{l\; m}^{D}(n)} = {\sum\limits_{k = 0}^{n}{{J_{0}\left( {2\pi \; f_{D}k\; \Delta \; T} \right)}{{\overset{\Cup}{h}}_{l\; m}^{D}\left( {n - k} \right)}}}} & {{Equation}\mspace{14mu} 7} \end{matrix}$

As for the order-one autoregressive model, so-called process-noise vectors {hacek over (h)}_(lm) ^(D)(n) are introduced assuming E└ h _(lm) ^(D)(n)({hacek over (h)}_(lm) ^(D)(n))^(H)┘=0 for n≠k and {hacek over (h)}_(lm) ^(D)(0)=h_(lm) ^(D)(0) being the CIR to be estimated. Assuming that CIR h_(lm) ^(D)(n) is estimated based on Z noisy observations d _(lm)(i)={{hacek over (d)}_(lm)(k), i≦k<i+Z}, the expression {hacek over (d)}_(lm)(i)=└(W

I_(D)) ^(H)d_(m)(i)┘_(k), (l−1)D≦k>lD results from the convolution of the ith block postfix by channel h_(lm) ^(D)(n) corrupted both by thermal noise and the OFDM data symbols. The OFDM data symbols are assumed zero-mean and independent of same variance as the postfix samples. d_(m)(i)=[(d_(m) ⁰(i))^(T), . . . , (d_(m) ^(M−1)(i))^(T]) ^(T) contains the received symbols after equalization of the pseudo random weighting factor of the postfixes (Equation 3). Thus, d _(lm)(i) can be expressed as follows:

$\begin{matrix} {{{{{\overset{\_}{d}}_{l\; m}(i)} = {{\left( {J \otimes C_{D}} \right)\begin{bmatrix} {{\overset{\Cup}{h}}_{l\; m}^{D}(0)} \\ {{\overset{\Cup}{h}}_{l\; m}^{D}(1)} \\ \vdots \\ {{\overset{\Cup}{h}}_{l\; m}^{D}\left( {Z - 1} \right)} \end{bmatrix}} + n}},{where}}{J = \begin{bmatrix} 1 & 0 & \ldots & 0 \\ {J_{0}\left( {2\; \pi \; f_{D}\Delta \; T} \right)} & 1 & ⋰ & 0 \\ \vdots & ⋰ & ⋰ & \vdots \\ {J_{0}\left( {2\; \pi \; {f_{D}\left( {Z - 1} \right)}\Delta \; T} \right)} & {J_{0}\left( {2\; \pi \; {f_{D}\left( {Z - 2} \right)}\Delta \; T} \right)} & \ldots & 1 \end{bmatrix}}} & {{Equation}\mspace{14mu} 8} \end{matrix}$

where n gathers the thermal noise and the interference from the OFDM data symbols. In order to guarantee the unit variance of each channel realisation, the norm of {hacek over (h)}_(lm) ^(D)(n), n=0, . . . , Z−1 is chosen such that:

$\begin{matrix} {{{\sum\limits_{n = 0}^{Z - 1}{\lbrack J\rbrack_{k,n}^{2}{E\left\lbrack {\left( {{\overset{\Cup}{h}}_{l\; m}^{D}(n)} \right)^{H}{{\overset{\Cup}{h}}_{l\; m}^{D}(n)}} \right\rbrack}}} = 1},{k = 0},\ldots \mspace{14mu},{Z - 1.}} & {{Equation}\mspace{14mu} 9} \end{matrix}$

It can thus be verified that the optimum estimator of h_(lm) ^(D)(0)={hacek over (h)}_(lm) ^(D)(0) in the MMSE sense is given from Equation 8 by:

$\begin{matrix} {{{{\hat{h}}_{l\; m}^{D}(i)} = {{M\left\lbrack {{\left( {J \otimes C_{D}} \right){D_{R_{b}}\left( {J \otimes C_{D}} \right)}^{H}} + R_{n}} \right\rbrack}^{- 1}{{\overset{\_}{d}}_{m}(i)}}}{{with}\text{:}}{{D_{R_{b}} = {{diag}\left\{ {R_{{\overset{\Cup \quad}{h}}_{l\; m}^{0}{(0)}},\ldots \mspace{14mu},R_{{\overset{\Cup}{h}}_{l\; m}^{0}{({Z - 1})}}} \right\}}},{M = {\left\lbrack {1,\ldots \mspace{14mu},{J_{0}\left( {2\pi \; {f_{D}\left( {Z - 1} \right)}\Delta \; T} \right)}} \right\rbrack \otimes \left( {R_{{\overset{\Cup}{h}}_{l\; m}^{0}{(0)}}C_{D}^{H}} \right)}}}} & {{Equation}\mspace{14mu} 10} \end{matrix}$

and R_(m)=E└aa^(H)┘ is the auto-correlation matrix of the vector a.

Since in practice the channel power profile is usually not known, in that case the assumption is made that

$R_{{\overset{\Cup}{h}}_{l\; m}^{D}{(n)}} \approx {g_{n}I_{D}}$

for all n. The real gain g_(n) is introduced for respecting the power constraints of Equation 9.

The above description presents generic channel estimation in the demodulator and equaliser 9 in accordance with embodiments of the present invention for both relatively static and high mobility environments. Their use for two STBC systems will now be described.

The first embodiment of STBC is based on ZP-OFDM decoding. The system includes modulators using pseudo-random postfixes at the transmitter and also equalizer structures derived for the MTMR case from those described for the Single Transmit Single Receive (STSR) case in our co-pending European Patent Application EP 02 292 730.5 based on the transformation of the received PRP-OFDM vector to the ZP-OFDM case. The system is described for the case of N_(t)=2 transit and N_(r)=1 receive antennas, although it will be appreciated that the system is applicable to other numbers of antennas. The ST encoder operates over N_(t)×M vectors with N_(t)=M=2. Since N_(r)=1, the subscript 1≦m≦N_(r) is not used in the following analysis. Perfect knowledge of the channels h_(l), I≦l≦N_(t) is assumed but it will be appreciated that the system is capable of working with imperfect channel knowledge.

At the transmitter, a 2×1 ZP-ST encoder

is used, which takes two consecutive OFDM symbols s(2i) and s(2i+1) to form the following coded matrix:

$\begin{matrix} {\begin{bmatrix} {{\overset{\_}{s}}_{1}\left( {2i} \right)} & {{\overset{\_}{s}}_{1}\left( {{2i} + 1} \right)} \\ {{\overset{\_}{s}}_{2}\left( {2i} \right)} & {{\overset{\_}{s}}_{2}\left( {{2i} + 1} \right)} \end{bmatrix} = \begin{bmatrix} {s\left( {2i} \right)} & {{- P_{N}^{0}}{s^{*}\left( {{2i} + 1} \right)}} \\ {s\left( {{2i} + 1} \right)} & {P_{N}^{0}{s^{*}\left( {2i} \right)}} \end{bmatrix}} & {{Equation}\mspace{14mu} 11} \end{matrix}$

where the permutation matrices P_(J) ^(n) are such that, for a J×1 vector a=[α(0) . . . , α(J−1)]^(T), we have {P_(N) ⁰a}_(p)=α((J−p+n)mod J).

Since the channel has been estimated, as for the single antenna case described in our co-pending European Patent Application, it is always possible to retrieve the MTMR ZP-OFDM signals from Equation 1 by subtracting from the received signal the known PRP contribution:

$\begin{matrix} {{r^{ZP}(n)} = {{r(n)} - {\sum\limits_{l = 1}^{2}\left\lbrack {{H_{l}^{IBI}{v_{l}\left( {n - 1} \right)}} + {H_{l}^{ISI}{v_{l}(n)}}} \right\rbrack}}} & {{Equation}\mspace{14mu} 12} \end{matrix}$

which leads to

${r^{ZP}(n)} = {\sum\limits_{l = 1}^{2}{H_{l}T_{ZP}{{{\overset{\_}{s}}_{l}(n)}.}}}$

Note that i) no constraint has to be set on W for the symbol recovery, ii) the PRP interference cancellation procedure proposed is generic and can be applied to any suitable ST encoder .

A suitable detection algorithm is applied to the signal described by Equation 12 by the demodulator and equaliser 9. Noticing that P_(P) ^(N)T_(ZP)=T_(ZP)P_(N) ⁰, we denote by {tilde over (D)}₁=diag{{tilde over (h)}₁}, {tilde over (D)}₁={{tilde over (h)}₁}, ñ(2i)=F_(p)n(2i) and ñ(2i+1)=F_(p)P_(P) ^(N)n·(2i+1); then if we switch to the frequency domain by computing {tilde over (y)}(2i)=F_(p)r^(ZP)(2i) and {tilde over (y)}(2i+1)=F_(p)(P_(P) ^(N)r^(ZP)(2i+1))^(n), exploiting the fact that H_(l)=F_(P) ^(H){tilde over (D)}_(l)F_(P), 1≦l≦2, we can write:

$\begin{matrix} {\begin{bmatrix} {\overset{\sim}{y}\left( {2i} \right)} \\ {\overset{\sim}{y}\left( {{2i} + 1} \right)} \end{bmatrix} = {{\underset{\underset{= \overset{\sim}{D}}{}}{\begin{bmatrix} {\overset{\sim}{D}}_{1} & {\overset{\sim}{D}}_{2} \\ {\overset{\sim}{D}}_{2}^{*} & {- {\overset{\sim}{D}}_{1}^{*}} \end{bmatrix}}\begin{bmatrix} {F_{P}T_{ZP}{s\left( {2i} \right)}} \\ {F_{P}T_{ZP}{s\left( {{2i} + 1} \right)}} \end{bmatrix}} + \begin{bmatrix} {\overset{\sim}{n}\left( {2i} \right)} \\ {\overset{\sim}{n}\left( {{2i} + 1} \right)} \end{bmatrix}}} & {{Equation}\mspace{14mu} 13} \end{matrix}$

where {tilde over (D)} is an orthogonal channel matrix. Thus multiplying [{tilde over (y)}(2i)^(T) {tilde over (y)}(2i+1)^(T)]^(T) by {tilde over (D)}^(H) achieves the separation of the transmitted signals s(2i) and s(2i+1), and it can be shown that full transmit diversity is achieved. Note that the separation of signals allows the same equalisation schemes to be used in this embodiment of the present invention as in the single-antenna case described in our co-pending European Patent Application EP 02 292 730.5.

The second embodiment of STBC system is based on equalization of the full received block by diagonalisation of pseudo-circulant channel matrices. The ST data encoder

used in the demodulator and equaliser 9 is based on a version of the single antenna system described in our co-pending European Patent Application EP 02 292 730.5 modified to enable the equalization structure that is detailed below and outputs blocks N_(l)×M vectors with N_(l)=M=2.

and

are specified such that they generate the following matrix Q(i)={q_(l)(2i+k), 1≦l≦2, 0≦k<2} at the antenna outputs:

$\begin{matrix} {{Q(i)} = \begin{bmatrix} \begin{bmatrix} {s\left( {2i} \right)} \\ {{\alpha \left( {2i} \right)}c} \end{bmatrix} & {{- P_{P}^{0}}{Q_{\beta {(i)}}\begin{bmatrix} {s^{*}\left( {{2i} + 1} \right)} \\ {{\alpha \left( {{2i} + 1} \right)}c^{*}} \end{bmatrix}}} \\ \begin{bmatrix} {s\left( {{2i} + 1} \right)} \\ {{\alpha \left( {2i} \right)}c} \end{bmatrix} & {P_{P}^{0}{Q_{\beta {(i)}}\begin{bmatrix} {s^{*}\left( {2i} \right)} \\ {{\alpha \left( {{2i} + 1} \right)}c^{*}} \end{bmatrix}}} \end{bmatrix}} & {{Equation}\mspace{14mu} 14} \end{matrix}$

P_(P) ⁰ being a permutation matrix defined as previously (inversing the order of the vector elements), α(i) is complex with |α(i)|=1 being pseudo-random complex weighting factors as defined in our co-pending European Patent Application for the single antenna case with α(2i+1)=β²(i)α(2i), and β(i)=α(2i=2)/α(2i). Q_(β(i)) is defined as:

$Q_{\beta {(i)}} = {\begin{bmatrix} 0_{D \times N} & {{\beta (i)} \cdot I_{D}} \\ I_{N} & 0_{N \times D} \end{bmatrix}.}$

The D×1 postfix c is chosen such that it has Hermitian symmetry, that is to say that the complex conjugate of the vector read backwards is equal to the original c. As in our co-pending European Patent Application, the channels are represented by P×P pseudo-circulated channel matrices H_(l) ^(β(i)), 1≦l≦2. These are identical to standard circulant convolution matrices with the upper triangular part multiplied by the scalar factor β(i), in other words H_(l) ^(β(i))=H_(l) ^(ISI)+β(i)H_(l) ^(IBI).

With R(i)=[r^(T)(2i) r^(T)(2i+1)]^(T) and the noise matrix N(i)=[n^(T)(2i) n^(T)(2i+1)]^(T), the received signals over M=2 symbol times are given as follows:

${R(i)} = {\begin{bmatrix} {\sum\limits_{l = 1}^{2}\left\lbrack {{H_{l}^{IBI}{q_{l}\left( {{2i} - 1} \right)}} + {H_{l}^{ISI}{q_{l}\left( {2i} \right)}}} \right\rbrack} \\ {\sum\limits_{l = 1}^{2}\left\lbrack {{H_{l}^{IBI}{q_{l}\left( {2i} \right)}} + {H_{l}^{ISI}{q_{l}\left( {{2i} + 1} \right)}}} \right\rbrack} \end{bmatrix} + {N(i)}}$

With {circumflex over (R)}(i)=[{circumflex over (r)}^(T)(2i) {circumflex over (r)}^(T)(2i+1)]^(T), the following operations are performed at the demodulator and equaliser 9 on the received vectors:

$\begin{matrix} {{\hat{R}(i)} = \begin{bmatrix} {{r\left( {2i} \right)} + {2{c_{1}^{\beta {(i)}}(i)}}} \\ {Q_{\beta {(i)}}^{H}\left( {P_{P}^{0}\left( {{r\left( {{2i} + 1} \right)} + {2{c_{2}^{\beta {(i)}}(i)}}} \right)} \right)}^{*} \end{bmatrix}} \\ {= {\underset{\underset{= {W_{H}{(i)}}}{}}{\begin{bmatrix} H_{1}^{\beta {(i)}} & H_{2}^{\beta {(i)}} \\ \left( H_{2}^{\beta {(i)}} \right)^{H} & {- \left( H_{1}^{\beta {(i)}} \right)^{H}} \end{bmatrix}}\begin{bmatrix} \begin{bmatrix} {s\left( {2i} \right)} \\ {{\alpha \left( {2i} \right)}c} \end{bmatrix} \\ \begin{bmatrix} {s\left( {{2i} + 1} \right)} \\ {{\alpha \left( {2i} \right)}c} \end{bmatrix} \end{bmatrix}}} \end{matrix}$ where $\begin{matrix} {{{c_{1}^{\beta {(i)}}(i)} = {{\alpha \left( {2i} \right)}{\beta (i)}H_{1}^{IBI}T_{P}c}},} \\ {{c_{2}^{\beta {(i)}}(i)} = {{- \left\lbrack {{2\left\{ {\alpha \left( {2i} \right)} \right\} H_{1}^{IBI}} + {2\left\{ {\alpha \left( {2i} \right)} \right\} H_{2}^{IBI}}} \right\rbrack}T_{P}{c.}}} \end{matrix}$

In this embodiment of STBC system, the data symbols are separated in the demodulator and equaliser 9 by premultiplication of {circumflex over (R)}(i) by the Hermitian of the upper channel matrix W_(H)(i):

${{W_{H}(i)}{\hat{R}(i)}} = {\begin{bmatrix} H^{\beta {(i)}} & 0_{P \times P} \\ 0_{P \times P} & H^{\beta {(i)}} \end{bmatrix}\begin{bmatrix} \begin{bmatrix} {s\left( {2i} \right)} \\ {{\alpha \left( {2i} \right)}c} \end{bmatrix} \\ \begin{bmatrix} {s\left( {{2i} + 1} \right)} \\ {{\alpha \left( {2i} \right)}c} \end{bmatrix} \end{bmatrix}}$

with H^(β(i))=H₁ ^(β(i))(H₁ ^(β(i)))^(H)+H₂ ^(β(i))(H₂ ^(β(i)))^(H). The equalisation based on pseudo circulant channel matrices is then performed as presented in our co-pending European Patent Application for the single channel case. The PRP-OFDM postfix based blind channel estimation is performed based on R(i) as presented above. 

1-16. (canceled)
 17. A method of communication using Orthogonal Frequency Division Multiplexing (‘OFDM’) from a transmitter comprising a plurality of transit antenna means and a receiver comprising at least one receive antenna means, the method comprising: generating bit streams and corresponding sets of N frequency domain carrier amplitudes ({tilde over (s)}(kN+j), 0≦j≦N−1) modulated as OFDM symbols subsequently to be transmitted from a transmitter, where k is the OFDM symbol number and j indicates the corresponding OFDM carrier number; inserting affix information into guard intervals between consecutive time domain OFDM symbols; transmitting said time domain OFDM symbols including said affix information from said transmitter to said receiver; using said affix information at the receiver to estimate the Channel Impulse Responses (H_(lm) between the lth transmit and mth receive antenna) of the transmission channels between said transmitter and said receiver; and using the estimated Channel Impulse Response (Ĥ_(lm) between the lth transmit and mth receive antenna) to demodulate said bit streams in the signals received at said receiver, wherein said affix information is known to said receiver as well as to said transmitter, and is mathematically equivalent to a vector (c _(D)) that is common to said time domain OFDM symbols multiplied by at least first weighting factors (α_(k)) that are different for one time domain OFDM symbol (k) than for another and second weighting factors (w_(i)(k)) that enable one of said transmit antenna means (i) to be distinguished from another.
 18. A method of communication as claimed in claim 07, wherein said first weighting factors (α_(k)) have pseudo-random values.
 19. A method of communication as claimed in claim 07, wherein said first weighting factors (α_(k)) have complex values.
 20. A method of communication as claimed in claim 07, wherein said first weighting factors (α_(k)) are deterministic and are known to said receiver as well as to said transmitter independently of current communication between said receiver and said transmitter.
 21. A method of communication as claimed in claim 07, wherein said first weighting factors (α_(k)) are communicated from said transmitter to said receiver.
 22. A method of communication as claimed in claim 07, wherein said transmitter uses N_(t) transmit antenna means and the receiver uses N_(r) receive antenna means, M′ consecutive time domain OFDM data symbols are encoded by a specific space-time encoder

such that the encoder

produces M time domain OFDM data signals outputs for each of the N_(t) transmit antenna means and said vector (c_(D)) is encoded by a specific space-time encoder

such that the encoder

produces M affixes for each of the N_(t) transmit antenna means corresponding to said affix information weighted by said first and second weighting factors (α_(k)) and w_(i)(k), the resulting affixes being inserted between time domain OFDM data symbols for each of the N_(t) transmit antenna means.
 23. A method of communication as claimed in claim 22, wherein the matrix of said second weighting factors (w_(i)(k)) for said transmit antenna means and for a number N_(T) of consecutive symbols equal to the number N_(T) of said transmit antenna means is a non-orthogonal matrix (W) such that when multiplied by its complex conjugate transpose ((W)^(T))* the result is different from the identity matrix (I), weighted by a gain factor g₀ having a non-zero real value (i.e. g₀I≠W^(H)W).
 24. A method of communication as claimed in claim 22, wherein all transmit antenna outputs over M consecutive OFDM time domain symbols, including time domain OFDM data symbols space-time encoded by

and pseudo-random affixes space-time encoded by

, are grouped into a block S, for which said first weighting factors (α_(k)) are the same for OFDM symbols of the same block S but are different for OFDM symbols of different block S.
 25. A method of communication as claimed in claim 24, wherein said transmitted affixes enable the separation at said receiver of the transmitted guard interval affix information of said block S, and said second weighting factors (w_(i)(k)) enable the separation and estimation at said receiver of the different physical channels between said transmit antenna means and said at least one receive antenna means.
 26. A method of communication as claimed in claim 25, wherein demodulating said bit streams includes, for each said receive antenna means, multiplying a signal derived from the received signal d_(m) by the complex conjugate transpose of the Kronecker product of said matrix of said second weighting factors (w_(i)(k)) for said transmit antenna means by the identity matrix ((W×I_(D))^(H)) and using channel estimates derived form the results in demodulating said bit streams.
 27. A method of communication as claimed in claim 26, wherein the matrix of said second weighting factors (w_(i)(k)) for said transmit antenna means and for a number N_(t) of consecutive symbols equal to the number N_(t) of said transmit antenna means is a matrix (W) such that (W) alone is non-orthogonal, but (W) combined with the corresponding pseudo-random factors (60 _(k)) is orthogonal.
 28. A method of claim 22, wherein the matrix W corresponding to M×N_(t) of said second weighting factors (w_(i)(k)) for a number M of consecutive symbols and for said N_(t) transmit antenna means is an orthogonal matrix such that when multiplied by its complex conjugate transpose ((W)^(T))* the result is the identify matrix (I), weighted by a gain factor g₀ having a non-zero real value (i.e. g₀I=W^(H)W).
 29. A method of claim 17, wherein said second weighting factors (w_(i)(k)) take different values for each of said transmit antenna means so as to enable said physical channels to be distinguished.
 30. A method of claim 17, wherein estimating the Channel Impulse Response (H_(lm)) of the transmission channels between said transmitter and said receiver comprises a step of making a moving average estimation over a plurality of symbol periods of channels which are mathematically equivalent to the relationship: ${h_{l\; m}^{D}(n)} = {\sum\limits_{k = 0}^{n}{{J_{0}\left( {2\pi \; f_{D}k\; \Delta \; T} \right)}{{\overset{\Cup}{h}}_{l\; m}^{D}\left( {n - k} \right)}}}$ where J₀(·) is the 0th order Bessel function, ƒ_(D) is the Doppler frequency, ΔT is the MTMR PRP-OFDM block duration and {hacek over (h)}_(lm) ^(D)(n) is a zero-mean complex Gaussian of constant variance.
 31. A transmitter comprising generating means for generating bit streams modulated as OFDM symbols to be transmitted and for inserting affix information into a guard intervals between said OFDM symbols, said guard interval affix information being deterministic and suitable to be known to a receiver as well as to said transmitter and including vector (c_(D)) that is common to time domain OFDM symbols multiplied by first weighting factors (α_(k)) that are different for one time domain OFDM symbol (k) than for another and said second weighting factors (w_(i)(k)) that enable transmit antenna means (i) to be distinguished from another.
 32. The transmitter of claim 31 comprising demodulating means for receiving signals that comprises said bit streams modulated as said OFDM symbols with said guard interval affix information inserted between said OFDM symbols, said demodulating means being arranged to use said affix information from said guard intervals to estimate a Channel Impulse Response of the transmission channels and to use the estimated Channel Impulse Response to demodulate said bit streams in the signals received at said receiver, said guard interval affix information (w_(i)(k)α_(k)·c₀ to w_(i)(k)α_(k)·c_(D-1)) being deterministic and being known to said receiver. 